Partial and Fuzzy Constraint Satisfaction to Support Coalition Formation
نویسندگان
چکیده
منابع مشابه
Partial Constraint Satisfaction
A constraint satisfaction problem involves finding values for variables subject to constraints on which combinations of values are allowed. In some cases it may be impossible or impractical to solve these problems completely. We may seek to partially solve the problem in an "optimal" or "sufficient" sense. A formal model is presented for defining and studying such partial constraint satisfactio...
متن کاملDistributed Partial Constraint Satisfaction Problem
Many problems in multi-agent systems can be described as Distributed Constraint Satisfaction Problems (Distributed CSPs), where the goal is to nd a set of assignments to variables that satis es all constraints among agents. However, when real-life application problems are formalized as Distributed CSPs, they are often over-constrained and have no solution that satis es all constraints. This pap...
متن کاملExtending Fuzzy Constraint Satisfaction Problems
This paper propose a new type of Fuzzy CSP(Constraint Satisfaction Problem) that have a mixture of discrete and continuous domains, and a Spread-Repair algorithm. In traditional CSP and Fuzzy CSP, values for the variables are chosen from the discrete domains. However, this is often inconvenient when one wants to express real world problems. We show that this model, called HDFCSP(Hybrid Domain F...
متن کاملRecognizing Machining Features through Partial Constraint Satisfaction
Machining features are groupings of geometric and topological entities that have certain engineering sig-niicance. Recognizing these features from a designed parts is crucial in the automation of Computer Integrated Manufacturing (CIM). In this paper, the machining feature recognition problem is formulated as a partial constraint satisfaction problem (PCSP) where variables are the faces in the ...
متن کاملPartial Constraint Satisfaction of Disjunctive Temporal Problems
We present a method for finding optimal partial solutions to overconstrained instances of the Disjunctive Temporal Problems (DTP). The solutions are optimal in that they satisfy a maximal number of constraints. While partial constraint satisfaction (PCS) has been commonly applied to finite-domain CSPs, its application in this setting is of particular interest, as temporal problems are tradition...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2007
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2006.08.032